Finite counting automata
نویسندگان
چکیده
منابع مشابه
On Emptiness and Counting for Alternating Finite Automata
We investigate problems for regular languages coded by alternating nite automata. In automata and formal language theory, it is well-known that there is a language accepted by an n-state nondeterministic nite automaton but any deterministic nite automaton accepting that language must have at least 2 n states. Diierent representations of regular languages are used to deene problems of varying le...
متن کاملMultidimensional fuzzy finite tree automata
This paper introduces the notion of multidimensional fuzzy finite tree automata (MFFTA) and investigates its closure properties from the area of automata and language theory. MFFTA are a superclass of fuzzy tree automata whose behavior is generalized to adapt to multidimensional fuzzy sets. An MFFTA recognizes a multidimensional fuzzy tree language which is a regular tree language so that for e...
متن کاملCounting with Counterfree Automata
We study the power of balanced regular leaf-languages. First, we investigate (i) regular languages that are polylog-time reducible to languages in dot-depth 1/2 and (ii) regular languages that are polylog-time decidable. For both classes we provide • forbidden-pattern characterizations, and • characterizations in terms of regular expressions. Both classes are decidable. The intersection of clas...
متن کاملCoinductive Counting with Weighted Automata
A general methodology is developed to compute the solution of a wide variety of basic counting problems in a uniform way: (1) the objects to be counted are enumerated by means of an infinite weighted automaton; (2) the automaton is reduced by means of the quantitative notion of stream bisimulation; (3) the reduced automaton is used to compute an expression (in terms of stream constants and oper...
متن کاملClass Counting Automata on Datawords
In the theory of automata over infinite alphabets, a central difficulty is that of finding a suitable compromise between expressiveness and algorithmic complexity. We propose an automaton model where we count the multiplicity of data values on an input word. This is particularly useful when such languages represent behaviour of systems with unboundedly many processes, where system states carry ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Control
سال: 1962
ISSN: 0019-9958
DOI: 10.1016/s0019-9958(62)90244-9